//拉近距离:https://www.luogu.com.cn/problem/P2136
#include <iostream>
#include <queue>
#include <vector>
#include <cstring>

using namespace std;
typedef pair<int,int> PII;
const int N = 1e3 + 10;
vector<PII> edges[N];

int dist[N],cnt[N];
bool st[N];

int n,m;

bool spfa(int c)
{
    memset(dist,0x3f,sizeof dist);
    dist[1] = 0;
    queue<int> q;
    st[c] = true;
    q.push(c);
    while(q.size())
    {
        int t = q.front();
        q.pop();
        st[t] = false;
        for(auto& e : edges[t])
        {
            int u = e.first,w = e.second;
            if(dist[t] + w < dist[u])
            {
                dist[u] = dist[t] + w;
                cnt[u]++;
                if(cnt[u] >= n)return true;
                if(st[u] == false)
                {
                    q.push(u);
                    st[u] = true;
                }
            }
        }
    }

    return false;
}


int main()
{
    cin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int s,t,w;
        cin >> s >> t >> w;
        w =-w;
        edges[s].push_back({t,w});    
    }
    if(spfa(1))cout << "Forever love";
    else
    {
        int ret = dist[n];
        if(spfa(n))
        {
            cout << "Forever love";
        }
        else
        {
            ret = min(ret,dist[1]);
            cout << ret;
        }

    }
 
    return 0;
}